polynomial time中文是什么意思

发音:

中文翻译
造句

多项式时间

polynomial adj. 1.【动、植】多词学名的。 2.【数学】多项式 ...
time n. 1.时，时间，时日，岁月。 2.时候，时刻；期间； ...
polynomial time algorithm 多项式时间算法
polynomial adj. 1.【动、植】多词学名的。 2.【数学】多项式的。 n. 1. 【动、植】多词学名。 2. 【数学】多项式。 a polynomial expression 多项式。
polynomial of 次多项式
addition of polynomial 多项式加法
affectless polynomial 无偏差多项式
affine polynomial 仿射多项式
alexander polynomial 亚历山大多项式
algebraic polynomial 代数多相式; 代数多项式
andre polynomial 安得列多项式
approximation by polynomial 多项式逼近
approximation polynomial 近似多项式
associated polynomial 伴随多项式
auxiliary polynomial 辅助多项式
bernoulle polynomial 伯努利多项式
bernoulli polynomial 伯努利多项式
bernoullian polynomial 伯努利多项式
bernstein polynomial 伯思斯坦多项式
binary polynomial 二元多项式
bivariate polynomial 双变量多项式
characteristic polynomial 固有多项式; 特锗项式; 特徵多项式
chebyshev polynomial 车比雪夫多项式; 切比雪夫多项式
check polynomial 核对多项式; 核验多项式
chromatic polynomial 色度多项式; 色多项式

"查查词典"手机版

千万人都在用的超大词汇词典翻译APP

例句与用法

A polynomial time algorithm in positive define geometric programming with constraints
约束正定式几何规划的一种多项式时间算法
Because it can " t finish in polynomial time , the scheduling problem is known to be np - hard
由于该问题不能在多项式时间内求得最优解，因而被公认为一个np完全问题。
The complexity of kf - diff is o ( nlogn ) , while n is the number of the nodes in the tree , vs . polynomial time for previous algorithms
在算法复杂度上从先前的多项式时间提高到o ( nlogn ) ，其中n为文档结点数。
Radio communications systems , department of signals , sensors and systems , royal institute of technology , 10044 stockholm , sweden , october 2002 . 10 hajck b , wieselthier j . link scheduling in polynomial time
绝大部分方法在网络中有20 30个结点， 100 200条链路时就需要花几天甚至更多的时间来寻找最优调度。
It is shown that these four types of single machine scheduling problems can be modeled as an assignment problem by mathematical programming method , thus these four types of problems can be solved in polynomial time
用数学规划的方法证明了四类多准则下的单机排序问题可以转化为指派问题，从而这四类问题都多项式时间可解。
A set of algorithms are designed to address the two challenges and then a service pool can be automatically constructed and managed for given reliability and performance requirements in polynomial time
为此，我们设计了一组算法，在给定的可靠性和性能范围内，通过算法的调度，可以在多项式时间内对服务池自动地进行构造和管理。
We prove that the worst - case ratio of algorithm d is 15 / 13 , which is better than any other approximation algorithm except polynomial time approximation scheme considering with both worst - case ratio and time complexity
我们证明了对三台机情形，算法d的最坏情况界为15 13 ，该算法的最坏情况界和时间复杂性优于除近似方案以外的已有近似算法。
The experiments show that the performance of our method is similar to the ye - 0 . 699 algorithm , which is the best approximate algorithm in polynomial time . but our method can effectively solve the max - bisection problem with a large scale . 2
数值实验表明,该方法与ye - 0 . 699近似算法（现有的求解图的最大二等分问题的最好的多项式时间近似算法）得到的解的性能几乎没有差异
As the determination of such optimal multicast routes was computationally intractable in polynomial time , a multicast routing algorithm based on genetic algorithm was proposed to simultaneously optimize different parameter , in which multiple multicast tree route solutions were generated
由于多播路由的最优选择问题在多项式时间内难以求解，提出一种使用遗传算法的路由算法来同时优化不同的服务质量指标，计算产生出几种路由树。